One-loop matrix element emulation with factorisation awareness

نویسندگان

چکیده

In this article we present an emulation strategy for one-loop matrix elements. This is based on the factorisation properties of elements and extension work presented in arXiv:2107.06625. We show that a percent-level accuracy can be achieved even large multiplicity processes. The point obtained such it dwarfs statistical training sample which allows us to use our model augment size set by orders magnitude without additional evaluations expensive

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank Matrix Factorisation

We introduce the problem of rank matrix factorisation (RMF). That is, we consider the decomposition of a rank matrix, in which each row is a (partial or complete) ranking of all columns. Rank matrices naturally appear in many applications of interest, such as sports competitions. Summarising such a rank matrix by two smaller matrices, in which one contains partial rankings that can be interpret...

متن کامل

Robust Bayesian Matrix Factorisation

We analyse the noise arising in collaborative ltering when formalised as a probabilistic matrix factorisation problem. We show empirically that modelling rowand column-speci c variances is important, the noise being in general non-Gaussian and heteroscedastic. We also advocate for the use of a Student-t prior for the latent features as the standard Gaussian is included as a special case. We der...

متن کامل

Bayesian Boolean Matrix Factorisation

Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns. We introduce the OrMachine, a probabilistic generative model for Boolean matrix factorisation and derive a Metropolised Gibbs s...

متن کامل

Fast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation

Nonnegative matrix factorisation and tri-factorisation Nonnegative matrix factorisation (NMF) and tri-factorisation (NMTF) methods decompose a given matrix R into two or three smaller matrices so that R ≈ UV T or R ≈ FSG , respectively. Schmidt, Winther and Hansen (2009) introduced a Bayesian version of nonnegative matrix factorisation (left), which we extend to matrix tri-factorisation (right)...

متن کامل

Aligning words using matrix factorisation

Aligning words from sentences which are mutual translations is an important problem in different settings, such as bilingual terminology extraction, Machine Translation, or projection of linguistic features. Here, we view word alignment as matrix factorisation. In order to produce proper alignments, we show that factors must satisfy a number of constraints such as orthogonality. We then propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2023

ISSN: ['1127-2236', '1126-6708', '1029-8479']

DOI: https://doi.org/10.1007/jhep05(2023)159